Conjugate-Permutable Subgroups

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On W -S-permutable Subgroups of Finite Groups∗

A subgroup H of a finite group G is said to be W -S-permutable in G if there is a subgroup K of G such that G = HK and H ∩K is a nearly S-permutable subgroup of G. In this article, we analyse the structure of a finite group G by using the properties of W -S-permutable subgroups and obtain some new characterizations of finite p-nilpotent groups and finite supersolvable groups. Some known results...

متن کامل

groups with all subgroups permutable or soluble

in this paper, we consider locally graded groups in which every non-permutable subgroup is soluble of bounded derived length.

متن کامل

On Ss-quasinormal and Weakly S-permutable Subgroups of Finite Groups

A subgroup H of a group G is called ss-quasinormal in G if there is a subgroup B of G such that G = HB and H permutes with every Sylow subgroup of B; H is called weakly s-permutable in G if there is a subnormal subgroup T of G such that G = HT and H ∩ T ≤ HsG, where HsG is the subgroup of H generated by all those subgroups of H which are s-permutable in G. We fix in every non-cyclic Sylow subgr...

متن کامل

Finding conjugate stabilizer subgroups of PSL(2;q)

We reduce a case of the hidden subgroup problem (HSP) in several families of finite groups of Lie type, such as SL(2; q), PSL(2; q), and PGL(2; q), to efficiently solvable HSPs in the affine group AGL(1; q). These groups act on projective space in an “almost” 3-transitive way, and we use this fact in each group to distinguish conjugates of its Borel (upper triangular) subgroup. Our observation ...

متن کامل

IDEMPOTENT n-PERMUTABLE VARIETIES

One of the important classes of varieties identified in tame congruence theory is the class of varieties which are n-permutable for some n. In this paper we prove two results: (1) For every n > 1 there is a polynomial-time algorithm which, given a finite idempotent algebra A in a finite language, determines whether the variety generated by A is n-permutable; (2) A variety is n-permutable for so...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1997

ISSN: 0021-8693

DOI: 10.1006/jabr.1996.6924